\begin{problem}{Bicycle}{bicycle.in}{bicycle.out}{1 second}{32 megabytes}

A bicycle race is being organized in a land far, far away. There are $N$ towns in the land, 
numbered 1 through $N$. There are also $M$ one-way roads between the towns. The race 
will start in town 1 and end in town 2.

How many different ways can the route be set? Two routes are considered different if 
they do not use the exact same roads.

\InputFile

The first line of input contains two integers $N$ and $M$ 
($1 \le N \le 10\,000$, $1 \le M \le 100\,000$), the number of towns and roads.

Each of the next $M$ lines contains two different integers $A$ and $B$, representing a road 
between towns $A$ and $B$.

Towns may be connected by more than one road.

\OutputFile

Output the number of distinct routes that can be set on a single line. If that number 
has more than nine digits, output only the last nine digits of the number. If 
there are infinitely many routes, output ``\texttt{inf}''.

\Example

\begin{example}
\exmp{
6 7
1 3
1 4
3 2
4 2
5 6
6 5
3 4
}{
3
}%
\exmp{
6 8
1 3
1 4
3 2
4 2
5 6
6 5
3 4
4 3
}{
inf
}%
\exmp{
31 60
1 3
1 3
3 4
3 4
4 5
4 5
5 6
5 6
6 7
6 7
\ldots
\ldots
\ldots
28 29
28 29
29 30
29 30
30 31
30 31
31 2
31 2
}{
073741824
}%
\end{example}

\end{problem}
